Self-confirming Games: Unawareness, Discovery, and Equilibrium

نویسنده

  • Burkhard C. Schipper
چکیده

Equilibrium notions for games with unawareness in the literature cannot be interpreted as steadystates of a learning process because players may discover novel actions during play. In this sense, many games with unawareness are “self-destroying” as a player’s representation of the game must change after playing it once. We define discovery processes where at each state there is an extensiveform game with unawareness that together with the players’ play determines the transition to possibly another extensive-form games with unawareness in which players are now aware of actions that they have previously discovered. A discovery process is rationalizable if players play extensiveform rationalizable strategies in each game with unawareness. We show that for any game with unawareness there is a rationalizable discovery process that leads to a self-confirming game that possesses an extensive-form rationalizable self-confirming equilibrium. This notion of equilibrium can be interpreted as steady-state of a learning and discovery process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian Games with Unawareness and Unawareness Perfection∗

Applying unawareness belief structures introduced in Heifetz, Meier, and Schipper (2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower awareness levels. We apply Bayesian games with unawareness to investigate the robustness of equilibri...

متن کامل

Digitized by the Internet Archive in 2011 with Funding from Boston Library Consortium Iviember Libraries Working Paper Department of Economics Self -confirming Equilibrium

Self-confirming equilibrium differs from Nash equilibrium in allowing players to have incorrect beliefs about how their opponents would play off of the equilibrium path. We provide several examples of ways that self-confirming and Nash equilibria differ. In games with "identified deviators , " all self -confirming equilibrium outcomes can be generated by extensive -form correlated equilibria. I...

متن کامل

Games with Unawareness

We provide a tool to model and solve strategic situations where players reasoning is limited, in the sense that they may only be aware of, or model, some of the aspects of the strategic situations at hand, as well as situations where players realize that other players’ perceptions may be limited. We define normal, repeated, incomplete information, and dynamic (extensive) form games with unaware...

متن کامل

Dynamic Games with Complete Awareness Information

I study games where players may be unaware of some fundamentals of the game itself, such as actions or players, and such unawareness may be lifted by other players’ actions during the play. Based on Li (2006a, 2006b), I propose a framework to deal with such games using standard tools of game theory, including generalization of familiar solution concepts such as Nash equilibrium and sequential e...

متن کامل

Computing a self-confirming equilibrium in two-player extensive-form games

The Nash equilibrium is the most commonly adopted solution concept for non–cooperative interaction situations. However, it underlays on the assumption of common information that is hardly verified in many practical situations. When information is not common, the appropriate game theoretic solution concept is the self–confirming equilibrium. It requires that every agent plays the best response t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017